Strict Ideal Completions of the Lambda Calculus

نویسنده

  • Patrick Bahr
چکیده

We present a family of infinitary lambda calculi with varying strictness. This family of calculi corresponds to the infinitary lambda calculi of Kennaway et al. but instead of metric completion our calculi are based on ideal completion. We show that each of our calculi conservatively extends the corresponding metric-based calculus. The extension that our calculi provide is characterised in the form of ’–-rules’: β-reduction in the metric calculi extended by these –-rules, also know as Böhm reduction, coincides with β-reduction in the corresponding ideal completion calculi. Thus, our calculi allow reasoning over partially converging infinite reductions without the need for additional rules, while their total fragments still coincide with the metric calculi. 1998 ACM Subject Classification F.4.2, F.1.1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2 Dynamically typed lambda calculus

We present an extension of a statically typed language with a special type Dynamic and explicit type tagging and checking operations (coercions). Programs in run-time typed languages are viewed as incomplete programs that are to be completed to well-typed programs by explicitly inserting coercions into them. Such completions are generally not unique. If the meaning of an incomplete program is t...

متن کامل

Cyclic Lambda Calculi

We precisely characterize a class of cyclic lambda-graphs, and then give a sound and complete axiomatization of the terms that represent a given graph. The equational axiom system is an extension of lambda calculus with the letrec construct. In contrast to current theories , which impose restrictions on where the rewriting can take place, our theory is very liberal, e.g., it allows rewriting un...

متن کامل

تأثیر مقیاس زمان سرمایش و غیر ایده‌آل بودن گاز در امواج ضربه ای

According to the suddenly compression of the matters in some regions of the compressible fluids, the density and temperature suddenly increases, and shockwaves can be produced. The cooling of post-shock region and non-idealness of the equation of state, $p=(k_B/mu m_p)rho T (1+brho) equivmathcal{K}rho T (1+eta R)$, where $mu m_p$ is the relative density of the post-shock gas and $Requiv rho_2 /...

متن کامل

Dynamic Typing: Syntax and Proof Theory

We present the dynamically typed λ-calculus, an extension of the statically typed λcalculus with a special type Dyn and explicit dynamic type coercions corresponding to runtime type tagging and type check-and-untag operations. Programs in run-time typed languages can be interpreted in the dynamically typed λ-calculus via a nondeterministic completion process that inserts explicit coercions and ...

متن کامل

Polymorphic Dynamic Typing

We study dynamic typing in continuation of Henglein’s dynamically typed λ-calculus, with particular regard to proof theoretic aspects and aspects of polymorphic completion inference. Dynamically typed λ-calculus provides a formal framework within which we can reason in a precise manner about properties of the process of completion for higher order programming languages. Completions arise from r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013